Markov bases for decomposable graphical models
نویسندگان
چکیده
منابع مشابه
Markov Bases for Decomposable Graphical Models
In this paper we show that primitive data swaps or moves are the only moves that have to be included in a Markov basis that links all the contingency tables having a set of fixed marginals when this set of marginals induce a decomposable independence graph. We give formulas that fully identify such Markov bases and show how to use these formulas to dynamically generate random moves.
متن کاملMarkov bases of decomposable models for contingency tables
We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterize the primitive moves (i.e. square-free moves of degree two) of Markov bases in terms of connected co...
متن کاملAn Algorithm for Combining Decomposable Graphical Models
We propose an algorithm for combining decomposable graphical models and apply it for building decomposable graphical log-linear models which involve a large number of variables. A main idea in this algorithm is that we group the random variables that are involved in the data into several subsets of variables, build graphical log-linear models for the marginal data, and then combine the marginal...
متن کاملMinimal and minimal invariant Markov bases of decomposable models for contingency tables
We study Markov bases of decomposable graphical models consisting of primitive moves (i.e. square-free moves of degree two) by determining the structure of fibers of sample size two. We show that the number of elements of fibers of sample size two are powers of two and we characterize primitive moves in Markov bases in terms of connected components of induced subgraphs of the independence graph...
متن کاملGraphical Markov Models
Graphical Markov models are multivariate statistical models which are currently under vigorous development and which combine two simple but most powerful notions, generating processes in single and joint response variables and conditional independences captured by graphs. The development of graphical Markov started with work by Wermuth (1976, 1980) and Darroch, Lauritzen and Speed (1980) which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2003
ISSN: 1350-7265
DOI: 10.3150/bj/1072215202